package mao.leetcode.array.leetcode48;

public class Solution {


    //未完成
    public void rotate(int[][] matrix) {
        int len = matrix.length;
        int temp=0;
        for (int i = 0; i < len; i++) {
            for (int j = 0; j < len/2; j++) {
                temp=matrix[i][j];
                matrix[i][j]=matrix[i][len-1-j];
                matrix[i][len-1-j]=temp;
            }
        }



    }
}
